Algorithmic Approach to a Minimization Problem
نویسندگان
چکیده
منابع مشابه
A New Algorithmic Approach to the IT Modernization Problem
This paper contains the research plan to develop a new simple, parsimonious algorithm to assist in the IT modernization decision making process. This algorithm will be developed based upon known, wellestablished models that exist in the area of decision making and technology acceptance.
متن کاملA Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
The Cutwidth Minimization Problem, also known as the Minimum Cut Linear Arrangement consists of finding an arrangement of the vertices of a graph on a line, in such a way that the maximum number of edges between each pair of consecutive vertices is minimized. This problem has practical applications in VLSI Design, Network Migration and Graph Drawing, among others. In this paper we propose sever...
متن کاملA Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem
The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investi...
متن کاملA Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem
The bandwidth of a sparse matrix is the distance from the main diagonal beyond which all elements of the matrix are zero. The bandwidth minimisation problem for a matrix consists of finding the permutation of rows and columns of the matrix which ensures that the non-zero elements are located in as narrow a band as possible along the main diagonal. This problem, which is known to be NP-complete,...
متن کاملA Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
We study the multi-layer crossing minimization problem from a polyhedral point of view. After the introduction of an integer programming formulation of the multi-layer crossing minimization problem, we examine the 2-layer case and derive several classes of facets of the associated polytope. Preliminary computational results for 2-and 3-layer instances indicate, that the usage of the correspondi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2012
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2012/310801